t-CIS codes over GF(p) and orthogonal arrays
نویسندگان
چکیده
منابع مشابه
Two-weight codes, graphs and orthogonal arrays
We investigate properties of two-weight codes over finite Frobenius rings, giving constructions for the modular case. A δ-modular code [15] is characterized as having a generator matrix where each column g appears with multiplicity δ|gR×| for some δ ∈ Q. Generalizing [10] and [5], we show that the additive group of a two-weight code satisfying certain constraint equations (and in particular a m...
متن کاملcs . I T ] 5 F eb 2 00 7 BOUNDS ON ORDERED CODES AND ORTHOGONAL ARRAYS
We derive new estimates of the size of codes and orthogonal arrays in the ordered Hamming space (the Niederreiter-Rosenbloom-Tsfasman space). We also show that the eigenvalues of the ordered Hamming scheme, the association scheme that describes the combinatorics of the space, are given by the multivariable Krawtchouk polynomials, and establish some of their properties.
متن کاملℤ4-codes and their Gray map images as orthogonal arrays
A classic result of Delsarte connects the strength (as orthogonal array) of a linear code with the minimum weight of its dual: the former is one less than the latter. Since the paper of Hammons et al., there is a lot of interest in codes over rings, especially in codes over Z4 and their (usually non-linear) binary Gray map images. We show that Delsarte’s observation extends to codes over arbitr...
متن کاملOn cyclic self-orthogonal codes over Z2m
The purpose of this paper is to study the cyclic self orthogonal codes over Zpm . After providing the generator polynomial of cyclic self orthogonal codes over Zpm , we give the necessary and sufficient condition for the existence of non-trivial self orthogonal codes over Zpm . We have also provided the number of such codes of length n over Zpm for any (p, n) = 1.
متن کاملLong quasi-polycyclic t-CIS codes
We study complementary information set codes of length tn and dimension n of order t called (t−CIS code for short). Quasi-cyclic and quasi-twisted tCIS codes are enumerated by using their concatenated structure. Asymptotic existence results are derived for one-generator and have co-index n by Artin’s conjecture for quasi cyclic and special case for quasi twisted. This shows that there are infin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.09.032